Locating a Circle on a Sphere

نویسندگان

  • Jack Brimberg
  • Henrik Juel
  • Anita Schöbel
چکیده

We consider the problem of locating a spherical circle with respect to existing facilities on a sphere, such that the sum of distances between the circle and the facilities is minimized, or such that the maximum distance is minimized. The problem properties are analyzed, and we give solution procedures. When the circle to be located is restricted to be a great circle, some simplifications are possible.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extrinsic sphere and totally umbilical submanifolds in Finsler spaces

‎Based on a definition for circle in Finsler space‎, ‎recently proposed by one of the present authors and Z‎. ‎Shen‎, ‎a natural definition of extrinsic sphere in Finsler geometry is given and it is shown that a connected submanifold of a Finsler manifold is totally umbilical and has non-zero parallel mean curvature vector field‎, ‎if and only if its circles coincide with circles of the ambient...

متن کامل

Regression Modeling for Spherical Data via Non-parametric and Least Square Methods

Introduction Statistical analysis of the data on the Earth's surface was a favorite subject among many researchers. Such data can be related to animal's migration from a region to another position. Then, statistical modeling of their paths helps biological researchers to predict their movements and estimate the areas that are most likely to constitute the presence of the animals. From a geome...

متن کامل

Camera Calibration Based on the Common Self-polar Triangle of Sphere Images

Sphere has been used for camera calibration in recent years. In this paper, a new linear calibration method is proposed by using the common self-polar triangle of sphere images. It is shown that any two of sphere images have a common self-polar triangle. Accordingly, a simple method for locating the vertices of such triangles is presented. An algorithm for recovering the vanishing line of the s...

متن کامل

The packing of circles on a hemisphere

The problem of the closest packing of N equal nonoverlapping circles on a sphere has been of interest in geometry, chemistry, biology, engineering and optimization. The problem of packing N equal nonoverlapping circles on a hemisphere is a different problem of the same type and is also of interest in various fields such as detecting signals in a multisource neighbourhood and measuring solar rad...

متن کامل

Determining the maximal singularity-free circle or sphere of parallel mechanisms using interval analysis

This paper proposes a systematic algorithm based on the interval analysis concept in order to obtain the maximal singularity-free circle or sphere within the workspace of parallel mechanisms. As case studies the 3-RPR planar and 6-UPS parallel mechanisms are considered to illustrate the relevance of the algorithm for 2D and 3D workspaces. To this end, the main algorithm is divided into four sub...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Operations Research

دوره 55  شماره 

صفحات  -

تاریخ انتشار 2007